Bipancyclic Properties of Faulty Hypercubes
نویسندگان
چکیده
منابع مشابه
Broadcasting on Faulty Hypercubes
In this paper we propose a method for constructing the maximum number of edge-disjoint spanning trees (in the directed sense) on a hypercube with arbitrary one faulty node. Each spanning tree is of optimal height. By taking the common neighbor of the roots of these edge-disjoint spanning trees as the new root and reversing the direction of the directed link from each root to the new root, a spa...
متن کاملSubcube Determination in Faulty Hypercubes
A hypercube may operate in a gracefully degraded manner, after faults arise, by supporting the execution of parallel algorithms in smaller fault-free subcubes. In order to reduce execution slowdown in a hypercube with given faults, it is essential to identify the maximum healthy subcubes in the faulty hypercube because the time for executing a parallel algorithm tends to depend on the dimension...
متن کاملEdge-bipancyclicity of conditional faulty hypercubes
Xu et al. showed that for any set of faulty edges F of an n-dimensional hypercube Qn with |F | n− 1, each edge of Qn − F lies on a cycle of every even length from 6 to 2n, n 4, provided not all edges in F are incident with the same vertex. In this paper, we find that under similar condition, the number of faulty edges can be much greater and the same result still holds. More precisely, we show ...
متن کاملLong pairs of paths in faulty hypercubes
Let F be a set of faulty vertices of the hypercube Qn and let A and B be two different sets of two vertices of Qn − F . We prove that if |F | ≤ n− 3, then Qn −F contains two vertex disjoint paths of total length at least 2 − 2|F | − 3 such that each them has one end-vertex in A and the other in B.
متن کاملEmbedded paths and cycles in faulty hypercubes
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists a cycle of length at least 2 − 2f in the complement of F . Until recently, exact values of fn were known only for n ≤ 4, and the best lower bound available for fn with n ≥ 5 was 2n−4. We prove that f5 = 8 and obtain the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Discrete Mathematics
سال: 2012
ISSN: 2090-7788
DOI: 10.5402/2012/308595